<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/graph_algorithms/single_source_shortest_path/bellman_ford/bellmanford_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('bellmanford__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">bellmanford_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="bellmanford__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef BELLMAN_FORD_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define BELLMAN_FORD_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="bellmanford_8h.html">bellmanford.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include&quot;../../basic_graph/graph_representation/graph/graph.h&quot;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#include&quot;../../basic_graph/graph_representation/graph_vertex/vertexp.h&quot;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">IntroductionToAlgorithm::GraphAlgorithm::Graph</a>;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_vertex_p.html">IntroductionToAlgorithm::GraphAlgorithm::VertexP</a>;</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a5ed496e8825564d0f9fcfe3b0ac41dec">IntroductionToAlgorithm::GraphAlgorithm::initialize_single_source</a>;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#afe2bd83fca7df7e07ece9a59b8e7f5a6">IntroductionToAlgorithm::GraphAlgorithm::relax</a>;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#ae96d9b844260ee3ce9225055040c631b">IntroductionToAlgorithm::GraphAlgorithm::bellman_ford</a>;</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a19237111c3b1ec2717c5e1aefe2f6d9b">IntroductionToAlgorithm::GraphAlgorithm::unlimit</a>;</div>
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html">   31</a></span>&#160;<span class="keyword">namespace</span>{</div>
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html#a2f96b50fa494ea2335e252edc99f0a48">   32</a></span>&#160;    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html#a2f96b50fa494ea2335e252edc99f0a48">B_NUM</a>=10;  </div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;}</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;</div>
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html">   40</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_bellman_ford_test.html">BellmanFordTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;{</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a81e8794fcae1d04ceb23de43c5944829">   43</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">Graph&lt;B_NUM,VertexP&lt;int&gt;</a>&gt; <a class="code" href="class_bellman_ford_test.html#a81e8794fcae1d04ceb23de43c5944829">GraphType</a>; </div>
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a823a571f7e631ee9e4f712440b35159d">   44</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_vertex_p.html">VertexP&lt;int&gt;</a> <a class="code" href="class_bellman_ford_test.html#a823a571f7e631ee9e4f712440b35159d">VertexType</a>; </div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a8cb2e8d725e4c06914dafc73c73d94c6">   46</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_bellman_ford_test.html#a8cb2e8d725e4c06914dafc73c73d94c6">SetUp</a>()</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    {</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a1e228fdc8f10f3932dfa93969b22740a">_1v_graph</a>=std::make_shared&lt;GraphType&gt;(-1);<span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a1e228fdc8f10f3932dfa93969b22740a">_1v_graph</a>-&gt;add_vertex(0);  <span class="comment">//该图只有一个顶点</span></div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a13720ba4e090b0accf73283c15a7f0ec">_1e_graph</a>=std::make_shared&lt;GraphType&gt;(-1);<span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a13720ba4e090b0accf73283c15a7f0ec">_1e_graph</a>-&gt;add_vertex(0);</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a13720ba4e090b0accf73283c15a7f0ec">_1e_graph</a>-&gt;add_vertex(0);</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a13720ba4e090b0accf73283c15a7f0ec">_1e_graph</a>-&gt;add_edge(std::make_tuple(0,1,1));  <span class="comment">//该图只有一条边</span></div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="comment">//****  含顶点图和边图：10个顶点，9条边：0--&gt;1--&gt;2....--&gt;9(权重均为1)   ****</span></div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a80eda504410ddbef790a30a0d4049185">_normal_graph</a>=std::make_shared&lt;GraphType&gt;(-1); <span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html#a2f96b50fa494ea2335e252edc99f0a48">B_NUM</a>;i++)</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            <a class="code" href="class_bellman_ford_test.html#a80eda504410ddbef790a30a0d4049185">_normal_graph</a>-&gt;add_vertex(0);</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;B_NUM-1;i++)</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;                <a class="code" href="class_bellman_ford_test.html#a80eda504410ddbef790a30a0d4049185">_normal_graph</a>-&gt;add_edge(std::make_tuple(i,i+1,1)); <span class="comment">//该图的边是从左到右组成一个链条</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="comment">//****  含顶点图和边图：10个顶点，10条边 :0--&gt;1--&gt;2....--&gt;9(权重均为1)以及 9--&gt;8(权重-2)  ****</span></div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a179a0a6d2ae9d6a2404ef5e5f9a06869">_minus_graph</a>=std::make_shared&lt;GraphType&gt;(-1); <span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html#a2f96b50fa494ea2335e252edc99f0a48">B_NUM</a>;i++)</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            <a class="code" href="class_bellman_ford_test.html#a179a0a6d2ae9d6a2404ef5e5f9a06869">_minus_graph</a>-&gt;add_vertex(0);</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;B_NUM-1;i++)</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;                <a class="code" href="class_bellman_ford_test.html#a179a0a6d2ae9d6a2404ef5e5f9a06869">_minus_graph</a>-&gt;add_edge(std::make_tuple(i,i+1,1));<span class="comment">//链条</span></div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <a class="code" href="class_bellman_ford_test.html#a179a0a6d2ae9d6a2404ef5e5f9a06869">_minus_graph</a>-&gt;add_edge(std::make_tuple(9,8,-2)); <span class="comment">//最后构成一个负权值回路</span></div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    }</div>
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a16ea847b45d890f27adf9381decdb5c8">   72</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_bellman_ford_test.html#a16ea847b45d890f27adf9381decdb5c8">TearDown</a>(){}</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;</div>
<div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a1e228fdc8f10f3932dfa93969b22740a">   74</a></span>&#160;    std::shared_ptr&lt;GraphType&gt; <a class="code" href="class_bellman_ford_test.html#a1e228fdc8f10f3932dfa93969b22740a">_1v_graph</a>; </div>
<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a13720ba4e090b0accf73283c15a7f0ec">   75</a></span>&#160;    std::shared_ptr&lt;GraphType&gt; <a class="code" href="class_bellman_ford_test.html#a13720ba4e090b0accf73283c15a7f0ec">_1e_graph</a>; </div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a80eda504410ddbef790a30a0d4049185">   76</a></span>&#160;    std::shared_ptr&lt;GraphType&gt; <a class="code" href="class_bellman_ford_test.html#a80eda504410ddbef790a30a0d4049185">_normal_graph</a>; </div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="class_bellman_ford_test.html#a179a0a6d2ae9d6a2404ef5e5f9a06869">   77</a></span>&#160;    std::shared_ptr&lt;GraphType&gt; <a class="code" href="class_bellman_ford_test.html#a179a0a6d2ae9d6a2404ef5e5f9a06869">_minus_graph</a>; </div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;};</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;</div>
<div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="bellmanford__test_8h.html#af7443f54257d582ee9699fb23e93e4b5">   84</a></span>&#160;<a class="code" href="bellmanford__test_8h.html#af7443f54257d582ee9699fb23e93e4b5">TEST_F</a>(<a class="code" href="class_bellman_ford_test.html">BellmanFordTest</a>,test_initialize_single_source)</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;{</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    EXPECT_THROW(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a5ed496e8825564d0f9fcfe3b0ac41dec">initialize_single_source</a>(std::shared_ptr&lt;GraphType&gt;(),0),std::invalid_argument );</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    EXPECT_THROW(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a5ed496e8825564d0f9fcfe3b0ac41dec">initialize_single_source</a>(_1v_graph,1),std::invalid_argument );</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a5ed496e8825564d0f9fcfe3b0ac41dec">initialize_single_source</a>(_normal_graph,0);</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html#a2f96b50fa494ea2335e252edc99f0a48">B_NUM</a>;i++)</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    {</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        EXPECT_FALSE(_normal_graph-&gt;vertexes[i]-&gt;parent);</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        <span class="keywordflow">if</span>(i==0) EXPECT_EQ(_normal_graph-&gt;vertexes[i]-&gt;key,0);</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;        <span class="keywordflow">else</span> EXPECT_EQ(_normal_graph-&gt;vertexes[i]-&gt;key,unlimit&lt;VertexType::KeyType&gt;());</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    }</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;}</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;</div>
<div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="bellmanford__test_8h.html#a0b3ee25ec3c5620243a59b5a2d593813">  102</a></span>&#160;<a class="code" href="bellmanford__test_8h.html#af7443f54257d582ee9699fb23e93e4b5">TEST_F</a>(<a class="code" href="class_bellman_ford_test.html">BellmanFordTest</a>,test_relax)</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;{</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a5ed496e8825564d0f9fcfe3b0ac41dec">initialize_single_source</a>(_normal_graph,0);</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    EXPECT_EQ(_normal_graph-&gt;vertexes[1]-&gt;key,unlimit&lt;VertexType::KeyType&gt;());</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    EXPECT_FALSE(_normal_graph-&gt;vertexes[1]-&gt;parent);</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#afe2bd83fca7df7e07ece9a59b8e7f5a6">relax</a>(_normal_graph-&gt;vertexes[0],_normal_graph-&gt;vertexes[1],_normal_graph-&gt;weight(0,1));</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;    EXPECT_EQ(_normal_graph-&gt;vertexes[1]-&gt;key,1);</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    EXPECT_EQ(_normal_graph-&gt;vertexes[1]-&gt;parent,_normal_graph-&gt;vertexes[0]);</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;}</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div>
<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="bellmanford__test_8h.html#a4e5952919bbb5a4696b91237432045aa">  116</a></span>&#160;<a class="code" href="bellmanford__test_8h.html#af7443f54257d582ee9699fb23e93e4b5">TEST_F</a>(<a class="code" href="class_bellman_ford_test.html">BellmanFordTest</a>,test_bellman_ford)</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;{</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;    <span class="comment">//************  只有一个顶点的图  ************</span></div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    EXPECT_THROW(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#ae96d9b844260ee3ce9225055040c631b">bellman_ford</a>(_1v_graph,1),std::invalid_argument);</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;    EXPECT_TRUE(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#ae96d9b844260ee3ce9225055040c631b">bellman_ford</a>(_1v_graph,0));</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;    EXPECT_EQ(_1v_graph-&gt;vertexes[0]-&gt;key,0);</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;    <span class="comment">//**********  只有一条边的图  ***************</span></div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    EXPECT_TRUE(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#ae96d9b844260ee3ce9225055040c631b">bellman_ford</a>(_1e_graph,0));</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    EXPECT_EQ(_1e_graph-&gt;vertexes[0]-&gt;key,0);</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;    EXPECT_EQ(_1e_graph-&gt;vertexes[1]-&gt;key,1);</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    EXPECT_EQ(_1e_graph-&gt;vertexes[1]-&gt;parent,_1e_graph-&gt;vertexes[0]);</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    <span class="comment">//**********  链边的图 ***************</span></div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    EXPECT_TRUE(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#ae96d9b844260ee3ce9225055040c631b">bellman_ford</a>(_normal_graph,0));</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;    EXPECT_EQ(_normal_graph-&gt;vertexes[0]-&gt;key,0);</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1;i&lt;<a class="code" href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html#a2f96b50fa494ea2335e252edc99f0a48">B_NUM</a>;i++)</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;    {</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        EXPECT_EQ(_normal_graph-&gt;vertexes[i]-&gt;key,i);</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        EXPECT_EQ(_normal_graph-&gt;vertexes[i]-&gt;parent,_normal_graph-&gt;vertexes[i-1]);</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    }</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    <span class="comment">//*********** 含有负权值回路的图  ***********</span></div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    EXPECT_FALSE(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#ae96d9b844260ee3ce9225055040c631b">bellman_ford</a>(_minus_graph,0));</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;}</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="preprocessor">#endif // BELLMAN_FORD_TEST</span></div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div>
<div class="ttc" id="class_bellman_ford_test_html_a179a0a6d2ae9d6a2404ef5e5f9a06869"><div class="ttname"><a href="class_bellman_ford_test.html#a179a0a6d2ae9d6a2404ef5e5f9a06869">BellmanFordTest::_minus_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GraphType &gt; _minus_graph</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00077">bellmanford_test.h:77</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html_a81e8794fcae1d04ceb23de43c5944829"><div class="ttname"><a href="class_bellman_ford_test.html#a81e8794fcae1d04ceb23de43c5944829">BellmanFordTest::GraphType</a></div><div class="ttdeci">Graph&lt; B_NUM, VertexP&lt; int &gt; &gt; GraphType</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00043">bellmanford_test.h:43</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_a5ed496e8825564d0f9fcfe3b0ac41dec"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a5ed496e8825564d0f9fcfe3b0ac41dec">IntroductionToAlgorithm::GraphAlgorithm::initialize_single_source</a></div><div class="ttdeci">void initialize_single_source(std::shared_ptr&lt; GraphType &gt; graph, typename GraphType::VIDType source_id)</div><div class="ttdoc">initialize_single_source：单源最短路径的初始化操作，算法导论24章24.1节 </div><div class="ttdef"><b>Definition:</b> <a href="bellmanford_8h_source.html#l00043">bellmanford.h:43</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html_a13720ba4e090b0accf73283c15a7f0ec"><div class="ttname"><a href="class_bellman_ford_test.html#a13720ba4e090b0accf73283c15a7f0ec">BellmanFordTest::_1e_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GraphType &gt; _1e_graph</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00075">bellmanford_test.h:75</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_vertex_p_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_vertex_p.html">IntroductionToAlgorithm::GraphAlgorithm::VertexP</a></div><div class="ttdoc">VertexP：图的顶点，它带一个parent属性，算法导论22章22.1节 </div><div class="ttdef"><b>Definition:</b> <a href="vertexp_8h_source.html#l00031">vertexp.h:31</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html"><div class="ttname"><a href="class_bellman_ford_test.html">BellmanFordTest</a></div><div class="ttdoc">BellmanFordTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00040">bellmanford_test.h:40</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html_a823a571f7e631ee9e4f712440b35159d"><div class="ttname"><a href="class_bellman_ford_test.html#a823a571f7e631ee9e4f712440b35159d">BellmanFordTest::VertexType</a></div><div class="ttdeci">VertexP&lt; int &gt; VertexType</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00044">bellmanford_test.h:44</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_afe2bd83fca7df7e07ece9a59b8e7f5a6"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#afe2bd83fca7df7e07ece9a59b8e7f5a6">IntroductionToAlgorithm::GraphAlgorithm::relax</a></div><div class="ttdeci">void relax(std::shared_ptr&lt; VertexType &gt; from, std::shared_ptr&lt; VertexType &gt; to, typename VertexType::KeyType weight)</div><div class="ttdoc">relax：单源最短路径的松弛操作，算法导论24章24.1节 </div><div class="ttdef"><b>Definition:</b> <a href="bellmanford_8h_source.html#l00082">bellmanford.h:82</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">IntroductionToAlgorithm::GraphAlgorithm::Graph</a></div><div class="ttdoc">Graph：图，算法导论22章22.1节 </div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00042">graph.h:42</a></div></div>
<div class="ttc" id="bellmanford__test_8h_html_af7443f54257d582ee9699fb23e93e4b5"><div class="ttname"><a href="bellmanford__test_8h.html#af7443f54257d582ee9699fb23e93e4b5">TEST_F</a></div><div class="ttdeci">TEST_F(BellmanFordTest, test_initialize_single_source)</div><div class="ttdoc">BellmanFordTest:测试单源最短路径的的initialize_single_source函数 </div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00084">bellmanford_test.h:84</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html_a1e228fdc8f10f3932dfa93969b22740a"><div class="ttname"><a href="class_bellman_ford_test.html#a1e228fdc8f10f3932dfa93969b22740a">BellmanFordTest::_1v_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GraphType &gt; _1v_graph</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00074">bellmanford_test.h:74</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html_a80eda504410ddbef790a30a0d4049185"><div class="ttname"><a href="class_bellman_ford_test.html#a80eda504410ddbef790a30a0d4049185">BellmanFordTest::_normal_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GraphType &gt; _normal_graph</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00076">bellmanford_test.h:76</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_a19237111c3b1ec2717c5e1aefe2f6d9b"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a19237111c3b1ec2717c5e1aefe2f6d9b">IntroductionToAlgorithm::GraphAlgorithm::unlimit</a></div><div class="ttdeci">T unlimit()</div><div class="ttdoc">unlimit：返回正无穷的函数 </div><div class="ttdef"><b>Definition:</b> <a href="header_8h_source.html#l00111">header.h:111</a></div></div>
<div class="ttc" id="namespaceanonymous__namespace_02bellmanford__test_8h_03_html_a2f96b50fa494ea2335e252edc99f0a48"><div class="ttname"><a href="namespaceanonymous__namespace_02bellmanford__test_8h_03.html#a2f96b50fa494ea2335e252edc99f0a48">anonymous_namespace{bellmanford_test.h}::B_NUM</a></div><div class="ttdeci">const int B_NUM</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00032">bellmanford_test.h:32</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html_a16ea847b45d890f27adf9381decdb5c8"><div class="ttname"><a href="class_bellman_ford_test.html#a16ea847b45d890f27adf9381decdb5c8">BellmanFordTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00072">bellmanford_test.h:72</a></div></div>
<div class="ttc" id="class_bellman_ford_test_html_a8cb2e8d725e4c06914dafc73c73d94c6"><div class="ttname"><a href="class_bellman_ford_test.html#a8cb2e8d725e4c06914dafc73c73d94c6">BellmanFordTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdef"><b>Definition:</b> <a href="bellmanford__test_8h_source.html#l00046">bellmanford_test.h:46</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_ae96d9b844260ee3ce9225055040c631b"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#ae96d9b844260ee3ce9225055040c631b">IntroductionToAlgorithm::GraphAlgorithm::bellman_ford</a></div><div class="ttdeci">bool bellman_ford(std::shared_ptr&lt; GraphType &gt; graph, typename GraphType::VIDType source_id)</div><div class="ttdoc">bellman_ford：单源最短路径的bellman_ford算法，算法导论24章24.1节 </div><div class="ttdef"><b>Definition:</b> <a href="bellmanford_8h_source.html#l00143">bellmanford.h:143</a></div></div>
<div class="ttc" id="bellmanford_8h_html"><div class="ttname"><a href="bellmanford_8h.html">bellmanford.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_aa0a5ddea82682e3e6fbdbaa3337ee0e.html">graph_algorithms</a></li><li class="navelem"><a class="el" href="dir_f2133faf2c2bedc6be9315237fa204fd.html">single_source_shortest_path</a></li><li class="navelem"><a class="el" href="dir_f699ffa9d8c159fc868ba829bb0de459.html">bellman_ford</a></li><li class="navelem"><a class="el" href="bellmanford__test_8h.html">bellmanford_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
